This paper is organized as follows

نویسنده

  • Julien Lamoureux
چکیده

As Field-Programmable Gate Array (FPGA) power consumption continues to increase, lower power FPGA circuitry, architectures, and Computer-Aided Design (CAD) tools need to be developed. Before designing low-power FPGA circuitry, architectures, or CAD tools, we must first determine where the biggest savings (in terms of energy dissipation) are to be made and whether these savings are cumulative. In this paper, we focus on FPGA CAD tools. Specifically, we describe a new power-aware CAD flow for FPGAs that was developed to answer the above questions. Estimating energy using very detailed post-route power and delay models, we determine the energy savings obtained by our poweraware technology mapping, clustering, placement, and routing algorithms and investigate how the savings behave when the algorithms are applied concurrently. The individual savings of the power-aware technology-mapping, clustering, placement, and routing algorithms were 7.6%, 12.6%, 3.0%, and 2.6% respectively. The majority of the overall savings were achieved during the technology mapping and clustering stages of the poweraware FPGA CAD flow. In addition, the savings were mostly cumulative when the individual power-aware CAD algorithms were applied concurrently with an overall energy reduction of 22.6%.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Self-organized Multi Agent Decision Making System Based on Fuzzy Probabilities: The Case of Aphasia Diagnosis

Aphasia diagnosis is a challenging medical diagnostic task due to the linguistic uncertainty and vagueness, large number of measurements with imprecision, inconsistencies in the definition of Aphasic syndromes, natural diversity and subjectivity in test objects as well as in options of experts who diagnose the disease. In this paper we present a new self-organized multi agent system that diagno...

متن کامل

The Vehicle Routing Problem: An overview of exact and approximate algorithms

In this paper , some of the main known results relative to the Vehicle Rout ing Problem are surveyed. The paper is organized as follows: (1) definition; (2) exact algorithms; (3) heuristic algorithms; (4) conclusion.

متن کامل

Retrieving Mystical Meanings in the Form and Structure of the Miniature of “Worldly and Otherworldly Drunkenness”

One of the most important aspects of an artistic expression in a work of art is the hidden form of its infrastructure. This item is especially noteworthy in Iranian painting. Symbolic and artistic expression in the works of the Safavid period are manifested in a well-organized manner in many paintings. Among the paintings depicted in the school of Tabriz II, the painting of Worldly and Otherwor...

متن کامل

Teaching-Learning approach in complexity paradigm

"Teaching-Learning Approach" is a model of interaction between teachers and students in an educational environment and one of the main components of the educational system. This model can be organized and designed on the basis of various opinions and ideas, including philosophical or scientific theories. This research aims to design and explain teaching-learning approach based on the complexity...

متن کامل

Supplementary Material: Deep Adaptive Image Clustering

This is the supplementary material for the paper entitled “Deep Adaptive Image Clustering”. The supplementary material is organized as follows. Section 1 gives the mapping function described in Figure 1. Section 2 presents the proof of Theorem 1. Section 3 details the experimental settings in our experiments. 1. The Mapping Function Utilized in Figure 1 We assume that li represents the label fe...

متن کامل

The Traveling Salesman Problem: An overview of exact and approximate algorithms

In this paper, some of the main known algorithms for the traveling salesman problem are surveyed. The paper is organized as follows: 1) definition; 2) applications; 3) complexity analysis; 4) exact algorithms; 5) heuristic algorithms; 6) conclusion.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003